Improved Alternative Route Planning
نویسندگان
چکیده
We present improved methods for computing a set of alternative source-to-destination routes in road networks in the form of an alternative graph. The resulting alternative graphs are characterized by minimum path overlap, small stretch factor, as well as low size and complexity. Our approach improves upon a previous one by introducing a new pruning stage preceding any other heuristic method and by introducing a new filtering and fine-tuning of two existing methods. Our accompanying experimental study shows that the entire alternative graph can be computed pretty fast even in continental size networks. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems, G2.2.2 Graph Theory, G.4 Mathematical Software
منابع مشابه
An Improved Particle Swarm Optimization Algorithm Used for Unmanned Aerial Vehicle Fixed-point Reconnaissance Route Planning
The paper puts forward an unmanned aerial vehicle (UAV) fixed-point reconnaissance route planning method. The method introduces the improved particle swarm optimization (IPSO) method to the planning of UAV reconnaissance route and adds the objective value, effective reconnaissance route and other factors affecting UAV reconnaissance route in the objective function of particle swam to obtain the...
متن کاملEvaluation of Weather Impact Models in Departure Management Decision Support: Operational Performance of the Route Availability Planning Tool (rapt) Prototype
There is a critical need for improved departure management during convective weather events in the highly congested airspace in the Northeast and upper Midwest. An early study (Allan, 2001) of the New York Integrated Terminal Weather System (ITWS) prototype suggested that small increases in New York airport departure rates during Severe Weather Avoidance Programs (SWAP) could result in signific...
متن کاملTRANSPORT ROUTE PLANNING MODELS BASED ON FUZZY APPROACH
Transport route planning is one of the most important and frequent activities in supply chain management. The design of information systems for route planning in real contexts faces two relevant challenges: the complexity of the planning and the lack of complete and precise information. The purpose of this paper is to nd methods for the development of transport route planning in uncertainty dec...
متن کاملContext-Aware Logistic Routing and Scheduling
In context-aware route planning, agents have to plan their route on a common infrastructure in such a way that plans made by other agents are not invalidated, and no conflicts are introduced. Previous research on context-aware routing, mostly in the domain of automated guided vehicle (AGV) routing, has reported on an O(nv) (n the number of vehicles, v the number of infrastructure resources) alg...
متن کاملIncorporating Bidirectional Heuristic Search and Improved ACO in Route Planning
A multi-objective multi-node dynamic route planning system for a vehicle is presented in this paper. In this system, a bidirectional heuristic search algorithm is designed to perform path planning between two nodes in a topological map created by OpenStreetMap for urban scenarios. And then an improved multi-objective Ant Colony Optimization (ACO) algorithm considering the timeliness of goal nod...
متن کامل